Hiding Resources that Can Fail
نویسندگان
چکیده
In earlier work, we presented a process algebra, PACSR, that uses resource failures to capture probabilistic behavior in reactive systems. In this paper, we explore the effects of resource failures in the situation where resources may be hidden from the environment. For this purpose, we introduce a subset of PACSR, called "PACSR-lite," that allows us to isolate the issues surrounding resource hiding, and we provide a sound and complete axiomatization of strong bisimulation for this fragment. Comments Postprint version. Published in Information Processing Letters, Volume 80, Issue 1, 15 October 2001, pages 3-13. Publisher URL: http://www.sciencedirect.com/science/journal/00200190 This journal article is available at ScholarlyCommons: http://repository.upenn.edu/cis_papers/142 Hiding Resources that Can Fail Anna Philippou, Oleg Sokolsky, Insup Lee, Rance Cleaveland, and Scott A. Smolka University of Cyprus. [email protected] University of Pennsylvania, USA. fsokolsky,[email protected] SUNY at Stony Brook, USA. france, [email protected]
منابع مشابه
Hiding resources that can fail: An axiomatic perspective
In earlier work, we presented a process algebra, PACSR, that uses a notion of resource failure to capture probabilistic behavior in reactive systems. PACSR also supports an operator for resource hiding. In this paper, we carefully consider the interaction between these two features from an axiomatic perspective. For this purpose, we introduce a subset of PACSR, called “PACSRlite”, that allows u...
متن کاملA survey on digital data hiding schemes: principals, algorithms, and applications
This paper investigates digital data hiding schemes. The concept of information hiding will be explained at first, and its traits, requirements, and applications will be described subsequently. In order to design a digital data hiding system, one should first become familiar with the concepts and criteria of information hiding. Having knowledge about the host signal, which may be audio, image, ...
متن کاملTopology-Hiding Computation
Secure Multi-party Computation (MPC) is one of the foundational achievements of modern cryptography, allowing multiple, distrusting, parties to jointly compute a function of their inputs, while revealing nothing but the output of the function. Following the seminal works of Yao and Goldreich, Micali and Wigderson and Ben-Or, Goldwasser and Wigderson, the study of MPC has expanded to consider a ...
متن کاملWIDER Working Paper No. 2013/007 Ties that bind: The kin system as a mechanism of income-hiding between spouses in rural Ghana
I present a model of intra-household allocation to show that when income is not perfectly observed by both spouses, hiding of income can occur even when revelation increases bargaining power. I draw data from Ghana and exploit the variation in the degree of asymmetric information between spouses, measured as the difference between the husband’s own reporting of farm sales and the wife’s reporti...
متن کاملTies that bind : The kin system as a mechanism of income - hiding between spouses in rural Ghana
I present a model of intra-household allocation to show that when income is not perfectly observed by both spouses, hiding of income can occur even when revelation increases bargaining power. I draw data from Ghana and exploit the variation in the degree of asymmetric information between spouses, measured as the difference between the husband’s own reporting of farm sales and the wife’s reporti...
متن کامل